Final Semantics for a Higher Order Concurrent Language
نویسنده
چکیده
We show that adequate semantics can be provided for imperative higher order concurrent languages simply using syntactical nal coalgebras. In particular we investigate and compare various behavioural equivalences on higher order processes deened by nality using hyper-sets and c.m.s.'s. Correspondingly, we derive various coinduction and mixed induction-coinduction proof principles for establishing these equivalences .
منابع مشابه
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types
This paper presents a typed higher-order concurrent functional programming language, based on Moggi’s monadic metalanguage and Reppy’s Concurrent ML. We present an operational semantics for the language, and show that a higherorder variant of the traces model is fully abstract for maytesting. This proof uses a program logic based on Hennessy– Milner logic and Abramsky’s domain theory in logical...
متن کاملObservational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures
We present an observational semantics for λ(fut), a concurrent λ-calculus with reference cells and futures. The calculus λ(fut) models the operational semantics of the concurrent higher-order programming language Alice ML. Our result is a powerful notion of equivalence that is the coarsest nontrivial congruence distinguishing observably different processes. It justifies a maximal set of correct...
متن کاملGOFFIN: Higher-Order Functions Meet Concurrent Constraints
We introduce a higher-order constraint-based language for structured and declarative parallel programming. The language, called Goffin, systematically integrates constraints and user-deened functions within a uniform setting of concurrent programming. From the perspective of parallel programming methodology, the constraint part of Goffin provides a coordination language for the functional part,...
متن کاملA Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation
This paper is about the relationship between the theory of monadic types and the practice of concurrent functional programming. We present a typed functional programming language CMML, with a type system based on Moggi’s monadic metalanguage, and concurrency based on Reppy’s Concurrent ML. We present an operational and denotational semantics for the language, and show that the denotational sema...
متن کاملcmUML - A UML based Framework for Formal Specification of Concurrent, Reactive Systems
Complex software systems possess concurrent and reactive behaviors requiring precise specifications prior to development. Lamport’s transition axiom method is a formal specification method which combines axiomatic and operational approaches. On the other hand Unified Modeling Language (UML), a de facto industry standard visual language, lacks suitable constructs and semantics regarding concurre...
متن کامل